#include"AVLTree.h"
#include<vector>

int main()
{
	const int N = 10;
	srand(time(0));
	AVLTree<int ,int> t;
	//int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	//int a[] = { 4, 2, 63, 11111, 399999, 5, 15, -7, 16, 14 };
	//for (auto e : a)
	//{
	//	if (e == 14)
	//	{
	//		int x=100;
	//	}
	//	t.insert(make_pair(e, e));
	//	cout << e << "->" << t.isBalance()<< endl;
	//}
	vector<int> v;
	v.reserve(N);
	for (int i = 0; i < N; i++)
	{
		v.push_back(rand());
	}

	for (auto e : v)
	{
		t.insert(make_pair(e,e));
	}
	cout << t.isBalance() << endl;
	//t.InOrder();
	return 0;
}